Hybrid Overlay Structure Based on Random Walks
نویسندگان
چکیده
Application-level multicast on structured overlays often suffer several drawbacks: 1) The regularity of the architecture makes it difficult to adapt to topology changes; 2) the uniformity of the protocol generally does not consider node heterogeneity. It would be ideal to combine the scalability of these overlays with the flexibility of an unstructured topology. In this paper, we propose a locality-aware hybrid overlay that combines the scalability and interface of a structured network with the connection flexibility of an unstructured network. Nodes self-organize into structured clusters based on network locality, while connections between clusters are created adaptively through random walks. Simulations show that this structure is efficient in both delay and bandwidth. The network also supports the scalable fast rendezvous interface provided by structured overlays, resulting in fast membership operations.
منابع مشابه
Peer-to-peer overlays: structured, unstructured, or both?
We compare structured and unstructured overlays and derive a hybrid overlay that can outperform both. Unstructured overlays build a random graph and use flooding or random walks on that graph to discover data stored by overlay nodes. Structured overlays assign keys to data items and build a graph that maps each key to the node that stores the corresponding data. Unstructured overlays are widely...
متن کاملDesign of a Novel Network Architecture for Distributed Event-Based Systems Using Directional Random Walks in an Ubiquitous Sensing Scenario
Ubiquitous sensing devices frequently disseminate data among them. The use of a distributed event-based system that decouples publishers from subscribers arises as an ideal candidate to implement the dissemination process. In this paper, we present a network architecture that merges the network and overlay layers of typical structured event-based systems. Directional random walks are used for t...
متن کاملUsing Random Walks to Find Resources in Unstructured Self-Organized P2P Networks∗
In this paper we present on-going work on the use of random walks as the basic mechanism to locate resources in Peer-to-Peer (P2P) systems. In this work we combine random walks with a self-organization of the overlay network, which dynamically adapts the topology of the network to the load of the system. We present the self-organization techniques we have proposed, and show by empirical evaluat...
متن کاملA least resistance path to the analysis of unstructured overlay networks
Unstructured overlay networks for peer-to-peer applications combined with stochastic algorithms for interest-based clustering and resource location are attractive due to low-maintenance costs and inherent fault-tolerance properties. Moreover, there is a relatively large volume of experimental evidence that these methods are efficiency-wise a good alternative to structured methods, which require...
متن کاملAssessing the Impact of Node Churn to Random Walk-Based Overlay Construction
Distributed systems desire to construct a random overlay graph for robustness, efficient information dissemination and load balancing. A random walk-based overlay construction is a promising alternative to generate an ideal random scale free overlay in distributed systems. However, a simple random walk-based overlay construction can be affected by node churn. Especially, the number of edges inc...
متن کامل